Degrees of Undecidability in Term Rewriting
نویسندگان
چکیده
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of undecidability, starting from the arithmetical hierarchy classifying properties using first order arithmetical formulas and continuing into the analytic hierarchy, where also quantification over function variables is allowed. In this paper we consider properties of first order term rewriting systems and classify them in this hierarchy. Most of the standard properties are Π2-complete, that is, of the same level as uniform halting of Turing machines. In this paper we show two exceptions. Weak confluence is Σ1complete, and therefore essentially easier than ground weak confluence which is Π2-complete. The most surprising result is on dependency pair problems: we prove this to be Π1-complete, which means that this property exceeds the arithmetical hierarchy and is essentially analytic. A minor variant, dependency pair problems with minimality flag, turns out be Π2-complete again, just like the original termination problem for which dependency pair analysis was developed.
منابع مشابه
Degrees of Undecidability in Rewriting
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of undecidability, starting from the arithmetical hierarchy classifying properties using first order arithmetical formulas and continuing into the analytic hierarchy, wh...
متن کاملRelative Undecidability in Term Rewriting
For two hierarchies of properties of term rewriting systems related to con uence and termination, respectively, we prove relative undecidability : for implications X ) Y in the hierarchies the property X is undecidable for term rewriting systems satisfying Y .
متن کاملRelative Undecidability in Term Rewriting Part 2: The Confluence Hierarchy
For a hierarchy of properties of term rewriting systems related to confluence we prove relative undecidability, i.e., for implications X ⇒ Y in the hierarchy the property X is undecidable for term rewriting systems satisfying Y . For some of the implications either X or ¬X is semi-decidable, for others neither X nor ¬X is semi-decidable. We prove most of these results for linear term rewrite sy...
متن کاملPrimitive Rewriting
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Another natural candidate for proofs regarding term rewriting is Recursion Theory, a direction we promote in this contribution. We present some undecidability results for “primitive” term rewriting systems, which encode pri...
متن کاملThe Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems
By reduction from the halting problem for Minsky’s two-register machines we prove that there is no algorithm capable of deciding the ∃∀∀∀-theory of one step rewriting of an arbitrary finite linear confluent finitely terminating term rewriting system (weak undecidability). We also present a fixed such system with undecidable ∃∀∗-theory of one step rewriting (strong undecidability). This improves...
متن کامل